One hyper-heuristic approach to two timetabling problems in health care
نویسندگان
چکیده
منابع مشابه
Hybrid Graph Heuristics within a Hyper-heuristic Approach to Exam Timetabling Problems
This paper is concerned with the hybridization of two graph coloring heuristics (Saturation Degree and Largest Degree), and their application within a hyperheuristic for exam timetabling problems. Hyper-heuristics can be seen as algorithms which intelligently select appropriate algorithms/heuristics for solving a problem. We developed a Tabu Search based hyper-heuristic to search for heuristic ...
متن کاملA graph-based hyper-heuristic for educational timetabling problems
This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Within the hyperheuristic framework, a Tabu Search approach is employed to search for permutations of graph heuristics which are used for constructing timetables in exam and course timetabling problems. This underpins a m...
متن کاملNovel Hyper-heuristic Approaches in Exam Timetabling
This thesis presents an investigation into the use of hyper-heuristic approaches to construct and improve solutions for exam timetabling problems. The majority of the approaches developed in the literature operate on a space of potential solutions to a problem. However, a hyper-heuristic is a heuristic which acts on a space of heuristics, rather than a solution space directly. The majority of r...
متن کاملCase-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling Problems
This paper studies Knowledge Discovery (KD) using Tabu Search and Hill Climbing within Case-Based Reasoning (CBR) as a hyper-heuristic method for course timetabling problems. The aim of the hyper-heuristic is to choose the best heuristic(s) for given timetabling problems according to the knowledge stored in the case base. KD in CBR is a 2-stage iterative process on both case representation and ...
متن کاملHySST: Hyper-heuristic Search Strategies and Timetabling
High school timetabling (HST) is a well-known real-world combinatorial optimisation problem. It requires the scheduling of events and resources, such as courses, classes of students, teachers, rooms and more within a fixed number of time slots subject to a set of constraints. In a standard fashion, constraints are separated into ‘hard’ and soft. The hard constraints must be satisfied in order t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Heuristics
سال: 2011
ISSN: 1381-1231,1572-9397
DOI: 10.1007/s10732-011-9192-0